Probabilistic Analysis for Optimal Speculation of Finite-State Machine Applications
نویسندگان
چکیده
Finite-State Machine (FSM) applications are important for many domains. But FSM computation is inherently sequential, making such applications notoriously difficult to parallelize. Most prior methods address the problem through speculations on simple heuristics, offering limited applicability and inconsistent speedups. This paper provides some principled understanding of FSM parallelization, and offers the first disciplined way to exploit application-specific information to inform speculations for parallelization. Through a series of rigorous analysis, it presents a probabilistic model that captures the relations between speculative executions and the properties of the target FSM and its inputs. With the formulation, it proposes two model-based speculation schemes that automatically customize themselves with the suitable configurations to maximize the parallelization benefits. This rigorous treatment yields near-linear speedup on applications that stateof-the-art techniques can barely accelerate.
منابع مشابه
Probabilistic Models towards Optimal Speculation of Finite State Machine Applications
Software-based speculative parallelization has shown effectiveness in parallelizing certain applications. Prior techniques have mainly relied on simple exploitation of heuristics for speculation. In this work, we introduce probabilistic analysis into the design of speculation schemes. In particular, by tackling applications that are based on Finite State Machine (FSM) which have the most preval...
متن کاملOptimal Design of Axial Flux Permanent Magnet Synchronous Motor for Electric Vehicle Applications Using GAand FEM
Axial Flux Permanent Magnet (AFPM) machines are attractive candidates for Electric Vehicles (EVs) applications due to their axial compact structure, high efficiency, high power and torque density. This paper presents general design characteristics of AFPM machines. Moreover, torque density of the machine which is selected as main objective function, is enhanced by using Genetic Algorithm (GA) a...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملStructural transformations of probabilistic finite state machines
Probabilistic finite state machines have recently emerged as a viable tool for modelling and analysis of complex non-linear dynamical systems. This paper rigorously establishes such models as finite encodings of probability measure spaces defined over symbol strings. The well known Nerode equivalence relation is generalized in the probabilistic setting and pertinent results on existence and uni...
متن کاملDesign Optimization and Construction of Double-Sided Linear Induction Motor
Linear induction motors have single and double-sided structures which are used in special applications, according to their advantages and disadvantages. Due to advantages such as lack of normal forces in double-sided type, these motors are more controllable and popular than the single-sided type, especially for transportation applications. In literature, single-sided linear induction motors ha...
متن کامل